A variable-metric variant of the Karmarkar algorithm for linear programming

A variable-metric variant of the Karmarkar algorithm for linear programming

Another Derivation of the Karmarkar Direction for Linear Programming

This paper provides another derivation of the Karmarkar direction for linear programming. It is strongly motivated by derivations of Gonzaga, but we show how the direction can be viewed as a steepest descent direction in the original feasible region corresponding to a metric diierent from the Euclidean one. We show that a xed decrease in the potential function can be obtained by taking a step i...

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

A Mathematical Modeling for Plastic Analysis of Planar Frames by Linear Programming and Genetic Algorithm

In this paper, a mathematical modeling is developed for plastic analysis of planar frames. To this end, the researcher tried to design an optimization model in linear format in order to solve large scale samples. The computational result of CPU time requirement is shown for different samples to prove efficiency of this method for large scale models. The fundamental concept of this model is ob...

A gradient system on the quantum information space that realizes the Karmarkar flow for linear programming

Abstract. In the paper of Uwano [Czech. J. of Phys., vol.56, pp.1311-1316 (2006)], a gradient system is found on the space of density matrices endowed with the quantum SLD Fisher metric (to be referred to as the quantum information space) that realizes a generalization of a gradient system on the space of multinomial distributions studied by Nakamura [Japan J. Indust. Appl. Math., vol.10, pp.17...